Classifying categories for partial equational logic
نویسندگان
چکیده
منابع مشابه
Classifying categories for partial equational logic
Along the lines of classical categorical type theory for total functions, we establish correspondence results between certain classes of partial equational theories on the one hand and suitable classes of categories having certain finite limits on the other hand. E.g., we show that finitary partial theories with existentially conditioned equations are essentially the same as cartesian categorie...
متن کاملQuasi-Equational Logic for Partial Algebras
In the line of introducing a manageable model theoretic approach to partial algebras, here such classes of partial algebras are to be considered in which free algebras still exist (in a categorical language: which are epireflective). This note is to be understood as one among others introducing this kind of model theory (in another one, see [4], varieties of partial algebras are considered). We...
متن کاملPartial Horn logic and cartesian categories
A logic is developed in which function symbols are allowed to represent partial functions. It has the usual rules of logic (in the form of a sequent calculus) except that the substitution rule has to be modi ed. It is developed here in its minimal form, with equality and conjunction, as partial Horn logic . Various kinds of logical theory are equivalent: partial Horn theories, quasi-equational ...
متن کاملRunning Head: Classifying with Essentialized Categories Classifying with Essentialized Categories
A central tenet of modern categorization research is that real-world categories have no defining features, and that features are better thought of as probabilistically related to their category. Nevertheless, the belief in properties that are invariably associated with categories has persisted. One view— psychological essentialism—further states that essential properties and structures constrai...
متن کاملConstraint Equational Logic Programming and Resource{based Partial Order Planning
Nowadays planning systems are usually based on partially order sets of actions as these sets specify necessary ordering constraints but do not commit otherwise. While computing these sets one usually maintains lists of links in order to detect potential threats. As shown in this paper these maintenance operations are unneccessary if the preconditions as well as eeects of actions are modelled as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2003
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80571-1